Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
نویسندگان
چکیده
منابع مشابه
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
We present three new quantum hardcore functions for any quantum one-way function. We also give a “quantum” solution to Damg̊ard’s question (CRYPTO’88) on his pseudorandom generator by proving the quantum hardcore property of his generator, which has been unknown to have the classical hardcore property. Our technical tool is quantum list-decoding of “classical” error-correcting codes (rather than...
متن کاملConductance in quantum wires by three quantum dots arrays
A noninteracting quantum-dot arrays side coupled to a quantum wire is studied. Transport through the quantum wire is investigated by using a noninteracting Anderson tunneling Hamiltonian. The conductance at zero temperature develops an oscillating band with resonances and antiresonances due to constructive and destructive interference in the ballistic channel, respectively. Moreover, we have fo...
متن کاملChannel capacities of classical and quantum list decoding
We focus on classical and quantum list decoding. The capacity of list decoding was obtained by Nishimura in the case when the number of list does not increase exponentially. However, the capacity of the exponential-list case is open even in the classical case while its converse part was obtained by Nishimura. We derive the channel capacities in the classical and quantum case with an exponential...
متن کاملConductance in quantum wires by three quantum dots arrays
A noninteracting quantum-dot arrays side coupled to a quantum wire is studied. Transport through the quantum wire is investigated by using a noninteracting Anderson tunneling Hamiltonian. The conductance at zero temperature develops an oscillating band with resonances and antiresonances due to constructive and destructive interference in the ballistic channel, respectively. Moreover, we have fo...
متن کاملQuantum communication complexity of block-composed functions
A major open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical ones for computing a total Boolean function in the twoparty interactive model. The answer appears to be “No”. In 2002, Razborov proved this conjecture for so far the most general class of functions F (x, y) = fn(x1 · y1, x2 · y2, ..., xn · yn), where fn is a sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2010
ISSN: 0097-5397,1095-7111
DOI: 10.1137/080716840